Complete graph

Results: 868



#Item
221Graph theory / NP-complete problems / Clique / Independent set / Split graph / Neighbourhood / Bipartite graph / Degree / Vertex / Graph / Line graph / Chordal graph

PDF Document

Add to Reading List

Source URL: fpt.akt.tu-berlin.de

Language: English - Date: 2015-05-03 06:37:17
222Graph theory / Directed graph / Flow network / Edsger W. Dijkstra / Network theory / NP-complete problems

PDF Document

Add to Reading List

Source URL: www.francescobonchi.com

Language: English - Date: 2013-10-23 04:38:55
223NP-complete problems / Graph operations / Graph coloring / Dense subgraph / Graph partition / Community structure / Tree / Shortest path problem / Graph / Graph theory / Theoretical computer science / Mathematics

The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio

Add to Reading List

Source URL: research.yahoo.com

Language: English - Date: 2013-04-05 04:39:54
224Graph / Neighbourhood / Adjacency matrix / Line graph / Directed acyclic graph / Hamiltonian path / Eulerian path / Tree / Independent set / Graph theory / Mathematics / NP-complete problems

Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015

Add to Reading List

Source URL: doc.sagemath.org

Language: English - Date: 2015-06-24 05:21:38
225Clique problem / Clique / Graph operations / Networks / Tree decomposition / Decomposition method / Graph theory / Theoretical computer science / NP-complete problems

GMMCP Tracker: Globally Optimal Generalized Maximum Multi Clique Problem for Multiple Object Tracking Afshin Dehghan Shayan Modiri Assari Mubarak Shah Center for Research in Computer Vision, University of Central Florida

Add to Reading List

Source URL: crcv.ucf.edu

Language: English - Date: 2015-04-13 12:15:56
226Matroid theory / Polynomials / Tutte polynomial / Degree / Tree / NP-complete problems / Path decomposition / Handshaking lemma / Graph theory / Mathematics / Theoretical computer science

A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

Add to Reading List

Source URL: www.pkoms.com

Language: English - Date: 2011-12-29 23:15:14
227NP-complete problems / Travelling salesman problem / Induced path / Shortest path problem / Graph / Routing / Combinatorial optimization / Path / Hamiltonian path / Graph theory / Theoretical computer science / Mathematics

Optimization of Cable Cycles: A Trade-off between Reliability and Cost Master Thesis in Micro-data Analysis Author: Barsam Payvar

Add to Reading List

Source URL: www.statistics.du.se

Language: English - Date: 2014-04-22 07:57:30
228Computational geometry / Ε-net / Connectivity / NP / Erasure code / Planar graph / NP-complete problems / Dominating set / Tutte polynomial / Graph theory / Theoretical computer science / Mathematics

Hitting Set Algorithms for Fast Data Recovery in the Face of Geographic Correlated Attacks Alon Efrat Esther Ezra

Add to Reading List

Source URL: www.cims.nyu.edu

Language: English - Date: 2013-07-29 14:22:26
229Graph / Matching / Bipartite graph / Independent set / Matroid theory / Tutte polynomial / Path decomposition / Graph theory / Mathematics / NP-complete problems

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-05-28 05:33:34
230

Name _____________________________ Partner ____________________________ Data Analysis Challenge You will work with a partner on this activity, but you will each complete the steps and create your own graph(s). Agree on a

Add to Reading List

Source URL: www.lauracandler.com

Language: English - Date: 2010-09-26 12:02:49
    UPDATE